P, NP, Co-NP and weak systems of arithmetic
نویسندگان
چکیده
منابع مشابه
Turing Machines , P , NP and NP - completeness
I assume that most students have encountered Turing machines before. (Students who have not may want to look at Sipser’s book [3].) A Turing machine is defined by an integer k ≥ 1, a finite set of states Q, an alphabet Γ, and a transition function δ : Q×Γk → Q×Γk−1×{L, S,R}k where: • k is the number of (infinite, one-dimensional) tapes used by the machine. In the general case we have k ≥ 3 and ...
متن کاملP-matrix recognition is co-NP-complete
This is a summary of the proof by G.E. Coxson [1] that P-matrix recognition is co-NP-complete. The result follows by a reduction from the MAX CUT problem using results of S. Poljak and J. Rohn [5].
متن کاملOn Monadic NP vs. Monadic co-NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic (1 ;). Monadic NP is the class of problems expressible in monadic Z;, i.e., 1: with the restriction that the second-order quantifiers range only over sets (as opposed to ranging over, say, binary relations). We prove that connectivity of finite graph...
متن کاملThe ARNN model relativises P=NP and P!=NP
In this paper we prove that the relations P = NP and P 6= NP relativise to the deterministic / non-deterministic artificial recurrent neural net (ARNN ) with real weights (informally considered as oracles in [1] and [2]). Although, in the nineties, a dozen of papers were written on the ARNN model, some introducing computation via neural nets with real weights and some introducing non-determinis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00099-2